Note on Taking Square-Roots Modulo
نویسندگان
چکیده
In this contribution it is shown how Gauss’ famous cyclotomic sum formula can be used for extracting square-roots modulo .
منابع مشابه
Information Protection Based on Extraction of Square Roots of Gaussian Integers
A cryptosystem, based on computation of square roots of complex integers modulo composite n, is described in this paper. This paper provides an algorithm extracting a square root of Gaussian integer. Various properties of square roots and a method for finding Gaussian generators are demonstrated. The generators can be instrumental in constructing other cryptosystems. It is shown how to signific...
متن کاملSquare Roots Modulo p
The algorithm of Tonelli and Shanks for computing square roots modulo a prime number is the most used, and probably the fastest among the known algorithms when averaged over all prime numbers. However, for some particular prime numbers, there are other algorithms which are considerably faster. In this paper we compare the algorithm of Tonelli and Shanks with an algorithm based in quadratic fiel...
متن کاملOn Vafa’s Theorem for Tensor Categories
In this note we prove two main results. 1. In a rigid braided finite tensor category over C (not necessarily semisimple), some power of the Casimir element and some even power of the braiding is unipotent. 2. In a (semisimple) modular category, the twists are roots of unity dividing the algebraic integer D, where D is the global dimension of the category (the sum of squares of dimensions of sim...
متن کاملElementary Thoughts on Discrete Logarithms
Given a cyclic group G with generator g, and given an element t in G, the discrete logarithm problem is that of computing an integer l with g = t. The problem of computing discrete logarithms is fundamental in computational algebra, and of great importance in cryptography. In this lecture we shall examine how sometimes the problem may be reduced to the computation of discrete logarithms in smal...
متن کاملInteger factoring and modular square roots
Buresh-Oppenheim proved that the NP search problem to find nontrivial factors of integers of a special form belongs to Papadimitriou’s class PPA, and is probabilistically reducible to a problem in PPP. In this paper, we use ideas from bounded arithmetic to extend these results to arbitrary integers. We show that general integer factoring is reducible in randomized polynomial time to a PPA probl...
متن کامل